An Orthogonal Pseudo Random Sequence Subspace Projection for a High Capacity Cdma Watermarking Scheme

نویسندگان

  • B HARITHA
  • P MALATHI
  • N CHAITHANAYA BHARATHI
چکیده

AN ORTHOGONAL PSEUDO RANDOM SEQUENCE SUBSPACE PROJECTION FOR A HIGH CAPACITY CDMA WATERMARKING SCHEME M V S S BABU., Asst.Professor, Dept.of ECE, RISE KRISHNA SAI PRAKASAM GROUP OF INSTITUTIONS, ONGOLE. B HARITHA., IV ECE, RISE KRISHNA SAI PRAKASAM GROUP OF INSTITUTIONS, ONGOLE. P MALATHI., IV ECE, RISE KRISHNA SAI PRAKASAM GROUP OF INSTITUTIONS, ONGOLE. N CHAITHANAYA BHARATHI. IV ECE, RISE KRISHNA SAI PRAKASAM GROUP OF INSTITUTIONS, ONGOLE. [email protected] , [email protected] , [email protected] , [email protected] Abstract: In this paper, we are going to propose an orthogonal pseudorandom sequence subspace projection for a high capacity CDMA watermarking scheme. We introduce a new idea and that eliminate the interference due to the correlation between the host image and the code sequences in the watermarked image. We can improve the robustness, message capacity, PSNR of the watermarked image. We give the implementation steps of the proposed scheme and test its performance under different attack conditions like noising and JPEG attacks by a series of experiments. This proposed scheme experimental results shows better performance then the existing methods and overcame the previous drawbacks under different attack conditions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimum decoder for multiplicative spread spectrum image watermarking with Laplacian modeling

This paper investigates the multiplicative spread spectrum watermarking method for the image. The information bit is spreaded into middle-frequency Discrete Cosine Transform (DCT) coefficients of each block of an image using a generated pseudo-random sequence. Unlike the conventional signal modeling, we suppose that both signal and noise are distributed with Laplacian distribution, because the ...

متن کامل

An Adaptive Wavelet-Based Watermarking Using Shift-Orthogonal Finite-Length Sequences

This paper presents an adaptive wavelet-based image-watermarking scheme embedding shift-orthogonal finite-length sequences. This sequence has the characteristics of shift-orthogonality and mean 0, variance 1. The security of this sequence is higher than pseudo random sequence because of the parameters used to generate the sequence. Watermark embedding is based on the characteristics of the huma...

متن کامل

Downlink CDMA Systems with Space - Time Codes and Interference Cancellation 1

| Space-time coding and interference cancellation based on orthogonal projection are powerful techniques to improve the communication quality and capacity in downlink CDMA systems. Space-time encoder output stream is transmitted through fading channel using multiple transmitter antennas, increasing communication reliability against multipath fading. On the other hand, orthogonal projection-base...

متن کامل

On Pseudo-Random and Orthogonal Binary Spreading Sequences

Different pseudo-random or pseudo-noise (PN) as well as orthogonal sequences that can be used as spreading codes for code division multiple access (CDMA) cellular networks or can be used for encrypting speech signals to reduce the residual intelligence are investigated. We briefly review the theoretical background for direct sequence CDMA systems and describe the main characteristics of the max...

متن کامل

Lattice Costa schemes using subspace projection for digital watermarking

A general watermarking scheme employing lattice quantization is proposed and analyzed. This scheme is based on the equivalence of embedding in digital watermarking and transmission over so-called modulo-Λ channels. Main intention is to increase the maximum data rate which can be transmitted reliably (Shannon capacity of the scheme), tolerating a certain embedding and attack distortion. For this...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017